A Secure Wireless Communication Protocol using Diffie - Hellman Key Exchange

A Secure Wireless Communication Protocol using Diffie - Hellman Key Exchange

In 1976, Diffie and Hellman in their path breaking paper [5] proposed a two party key agreement protocol based on finite field. Diffie – Hellman Key Exchange Protocol [DH protocol] has unique importance in two party wireless communication scenarios. After this protocol several protocols have been proposed bases on DH protocol but the Man in the middle attack raises a serious security concern on...

Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman

When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow any information to be leaked that would allow verification of the password (a weak shared key), since an attacker who obtains this information may be able to run an off-line dictionary attack to determine the correct password. ...

Group Diffie-Hellman Key Exchange Secure against Dictionary Attacks

Group Diffie-Hellman schemes for password-based key exchange are designed to provide a pool of players communicating over a public network, and sharing just a human-memorable password, with a session key (e.g, the key is used for multicast data integrity and confidentiality). The fundamental security goal to achieve in this scenario is security against dictionary attacks. While solutions have b...

A Diffie-Hellman Key Exchange Protocol Without Random Oracles

Diffie-Hellman Key Exchange Protocol, Its Generalization and Nilpotent Groups

Author: Ayan Mahalanobis Title: Diffie-Hellman Key Exchange Protocol, its Generalization and Nilpotent Groups Dissertation Advisor: Dr. Spyros Magliveras Degree: Doctor of Philosophy Year: 2005 This dissertation has two chapters. In the first chapter we talk about the discrete logarithm problem, more specifically we concentrate on the Diffie-Hellman key exchange protocol. We survey the current ...